Dynamic Programming Algorithms on Directed Cographs
نویسندگان
چکیده
منابع مشابه
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs
This paper presents an optimal fully-dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc and vertex modification (insertion or deletion) in O(d) time where d is the number of arcs involved in the operation. Moreover, if the modified graph remains a directed cograph, the modular tree decomposition is update...
متن کاملDynamic Programming Algorithms
The setting is as follows. We wish to find a solution to a given problem which optimizes some quantity Q of interest; for example, we might wish to maximize profit or minimize cost. The algorithm works by generalizing the original problem. More specifically, it works by creating an array of related but simpler problems, and then finding the optimal value of Q for each of these problems; we calc...
متن کاملStaging Dynamic Programming Algorithms
Applications of dynamic programming (DP) algorithms are numerous, and include genetic engineering and operations research problems. At a high level, DP algorithms are specified as a system of recursive equations implemented using memoization. The recursive nature of these equations suggests that they can be written naturally in a functional language. However, the requirement for memoization pos...
متن کاملSelf-Stabilizing Dynamic Programming Algorithms on Trees
Dynamic programming is a bottom-up approach that is typically used for designing algorithms for optimization problems. Many graph-theoretic optimization problems that are NP-hard in general, can be eeciently solved, using dynamic programming, when restricted to trees. Examples of such problems include maximum weighted independent set and minimum weighted edge covering. In this paper, we present...
متن کاملNotes on Dynamic Programming Algorithms & Data Structures
The technique of Dynamic Programming (DP) could be described “recursion turned upside-down”. However, it is not usually used as an alternative to recursion. Rather, dynamic programming is used (if possible) for cases when a recurrence for an algorithmic problem will not run in polynomial-time if it is implemented recursively. So in fact Dynamic Programming is a morepowerful technique than basic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics, Optimization & Information Computing
سال: 2017
ISSN: 2310-5070,2311-004X
DOI: 10.19139/soic.v5i1.260